An Alternative Approach to Obtain the Exact Wave Functions of Time-Dependent Hamiltonian Systems Involving Quadratic, Inverse Quadratic, and (1/x)p+p(1/x) Terms

By using the Lewis-Riesenfeld theory and algebraic method, we present an alternative approach to obtain the exact solution of time-dependent Hamiltonian systems involving quadratic, inverse quadratic and (1/x)p+p(1/x) terms. This solution is discussed and compared with that obtained by Choi, J. R. (2003). International Journal of Theoretical Physics 42, 853]. PACS: 03.65Ge; 03.65Fd; 03.65Bz     

The differential equation satisfied by a plane curve of degree n

Eliminating the arbitrary coefficients in the equation of a generic plane curve of order n by computing sufficiently many derivatives, one obtains a differential equation. This is a projective invariant. The first one, corresponding to conics, has been obtained by Monge. Sylvester, Halphen, Cartan used invariants of higher order. The expression of these invariants is rather complicated, but becomes much simpler when interpreted in terms of symmetric functions.     

Hierarchy of rational order families of chaotic maps with an invariant measure

We introduce an interesting hierarchy of rational order chaotic maps that possess an invariant measure. In contrast to the previously introduced hierarchy of chaotic maps [1–5], with merely entropy production, the rational order chaotic maps can simultaneously produce and consume entropy. We compute the Kolmogorov-Sinai entropy of these maps analytically and also their Lyapunov exponent numerically, where the obtained numerical results support the analytical calculations.     

Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives

Locating a facility is often modeled as either the maxisum or the minisum problem, reflecting whether the facility is undesirable (obnoxious) or desirable. But many facilities are both desirable and undesirable at the same time, e.g., an airport. This can be modeled as a multicriteria network location problem, where some of the sum-objectives are maximized (push effect) and some of the sum-objectives are minimized (pull effect).We present a polynomial time algorithm for this model along with some basic theoretical results, and generalize the results also to incorporate maximin and minimax objectives. In fact, the method works for any piecewise linear objective functions. Finally, we present some computational results.     

A complete set of numerical invariants for a subfactor

We show that certain numerical invariants associated naturally to a subfactor planar algebra constitute a complete family in the sense of determining the isomorphism class of the subfactor planar algebra.In the course of the proof, we show also that planar algebra isomorphisms of subfactor planar algebras can always be chosen to be ∗-preserving. This latter statement generalises the fact that ‘Hopf algebra isomorphisms of finite-dimensional Kac algebras can be chosen to be ∗-preserving’.     

A co‐ordinate system independent streamwise upwind method for fluid flow computation

A new co‐ordinate invariant streamwise upwind formulation for convection dominated flows is developed. The eddy diffusivity/viscosity is added directly to the equations in order to remove the oscillations in the solution. The equations then can be solved by any high‐order scheme and the solution retains the accuracy of the high‐order scheme. The accuracy and reduced lateral thickness growth rate are demonstrated with several numerical examples, including pure convective flows and lid‐driven cavity flow. The lateral spreading due to the numerical diffusion is controlled by the anisotropic tensor. Copyright © 2004 John Wiley & Sons, Ltd.     

Point-to-Periodic and Periodic-to-Periodic Connections

In this work we consider computing and continuing connecting orbits in parameter dependent dynamical systems. We give details of algorithms for computing connections between equilibria and periodic orbits, and between periodic orbits. The theoretical foundation for these techniques is given by the seminal work of Beyn in 1994, “On well-posed problems for connecting orbits in dynamical systems”, where a numerical technique is also proposed. Our algorithms consist of splitting the computation of the connection from that of the periodic orbit(s). To set up appropriate boundary conditions, we follow the algorithmic approach used by Demmel, Dieci, and Friedman, for the case of connecting orbits between equilibria, and we construct and exploit the smooth block Schur decomposition of the monodromy matrices associated to the periodic orbits. Numerical examples illustrate the performance of the algorithms. This revised version was published online in July 2006 with corrections to the Cover Date.     

The PDE-preserving operators on nuclearly entire functions of bounded type

The PDE-preserving operators O on the space of nuclearly entire functions of bounded type H_Nb(E) on a Banach space E are characterized. An operator is PDE-preserving when it preserves homogenous solutions to homogeneous convolution equations. We establish a one to one correspondence between O and a set Σ of sequences of entire functionals, i.e. exponential type functions. In this way, algebraic structures on Σ, such as ring structures, can be carried over to O and vice versa. In particular, it follows that O is a non-commutative ring (algebra) with unity with respect to composition and the convolution operators form a commutative subring (subalgebra). We discuss range and kernel properties, for the operators in O, and characterize the projectors (onto polynomial spaces) in O by determining the corresponding elements in Σ. This revised version was published online in June 2006 with corrections to the Cover Date.     

双阱结构含时量子输运的微扰论及输运方程

利用Lewis-Riesenfeld不变量理论和与不变量有关的幺正变换方法研究了双阱结构含时量子 输运的微扰论.获得了双阱内含时薛定谔方程的精确解的完备集，在此基础上，把双阱与左 右热库的相互作用作为微挠，获得了双阱结构一阶近似下的输运方程，并在绝热近似下提供 了一种用于研究量子输运过程中几何相因子(Berry相因子)的方法. 关键词： 含时量子输运 输运方程 不变量 几何相因子     

Discretization and resolution of the (<Emphasis Type="Italic">r</Emphasis>|<Emphasis Type="Italic">X</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>)-medianoid problem involving quality criteria

In this paper an extension of the (r|X _p )-medianoid on networks introduced by Hakimi (1983) is studied. In this extension the customer considers not only the distance but some characteristics of the facilities such as store size, quality of service and parking space. A new firm wants to establishr new facilities which have to compete with thep facilities that already exist in the market. The entry firm wants to find their locations and characteristics to maximize profits. Three different customer choice rules (binary, partially binary and proportional preferences) are considered. Some discretization results are obtained and a resolution procedure is proposed. The problem is solved combining a global search algorithm based on a branch and bound procedure with some combinatorial heuristics (greedy, interchange, and tabu search). Some computational experiences are presented. Partially supported by Ministerio de Ciencia y Tecnología (Spain) and FEDER, grant BFM2002-04525-C02-01.